A symbolic-numeric silhouette algorithm
نویسندگان
چکیده
We have revisited the silhouette algorithm developed by Canny, and designed its new symbolic-numeric version. The symbolic-numeric silhouette algorithm do not require the symbolic computation of the determinants of resultant matrices, and can work on oating point arithmetic. Though its combinatorial complexity remains the same, but its algebraic complexity has been improved signi cantly which is very important towards its implementation. Several numerical examples are also presented.
منابع مشابه
A Symbolic-Numeric Software Package for the Computation of the GCD of Several Polynomials
This survey is intended to present a package of algorithms for the computation of exact or approximate GCDs of sets of several polynomials and the evaluation of the quality of the produced solutions. These algorithms are designed to operate in symbolic-numeric computational environments. The key of their effectiveness is the appropriate selection of the right type of operations (symbolic or num...
متن کاملPythagore ’ s Dilemma , Symbolic - Numeric Com - putation , and the Border Basis Method
In this tutorial paper, we first discuss the motivation of doing symbolic-numeric computation, with the aim of developing efficient and certified polynomial solvers. We give a quick overview of fundamental algebraic properties, used to recover the roots of a polynomial system, when we know the multiplicative structure of its quotient algebra. Then, we describe the border basis method, justifyin...
متن کاملNumeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semilinear second order parabolic partial differential equations. We prove that this family is well–conditioned from the numeric point of view, and ill–conditioned from the symbolic point of view. We exhibit a polynomial–time numeric algorithm solving any m...
متن کاملComputing linear transforms of symbolic signals
Signals that represent information may be classified into two forms: numeric and symbolic. Symbolic signals are discrete-time sequences that at, any particular index, have a value that is a member of a finite set of symbols. Set membership defines the only mathematical structure that symbolic sequences satisfy. Consequently, symbolic signals cannot be directly processed with existing signal pro...
متن کاملA Hybrid Symbolic-Numerical Method for Determining
17 In this article, we present a method for determining whether a model is at least locally identifiable and in the case of non-identifiable models whether any of the parameters are individually at least locally identifiable. This method combines symbolic and numeric methods to create an algorithm that is extremely accurate compared to other numeric methods and computationally inexpensive. A se...
متن کامل